Cutoff for the Star Transposition Random Walk
نویسندگان
چکیده
In this note, we give a complete proof of the cutoff phenomenon for the star transposition random walk on the symmetric group.
منابع مشابه
Cutoff Phenomena for Random Walks on Random Regular Graphs
The cutoff phenomenon describes a sharp transition in the convergence of a family of ergodic finite Markov chains to equilibrium. Many natural families of chains are believed to exhibit cutoff, and yet establishing this fact is often extremely challenging. An important such family of chains is the random walk on G(n, d), a random d-regular graph on n vertices. It is well known that the spectral...
متن کاملExplicit expanders with cutoff phenomena
The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph. The first example of a family of bounded-degree graphs where the random walk exhibits cutoff in total-variation was provided only very recently, when the aut...
متن کاملA Coupling Argument for the Random Transposition Walk
This paper explores the mixing time of the random transposition walk on the symmetric group Sn. While it has long been known that this walk mixes in O(n log n) time, this result has not previously been attained using coupling. A coupling argument showing the correct order mixing time is presented. This is accomplished by first projecting to conjugacy classes, and then using the Bubley-Dyer path...
متن کاملModi!ed logarithmic Sobolev inequalities for some models of random walk!
Logarithmic Sobolev inequalities are a well-studied technique for estimating rates of convergence of Markov chains to their stationary distributions. In contrast to continuous state spaces, discrete settings admit several distinct log Sobolev inequalities, one of which is the subject of this paper. Here we derive modi!ed log Sobolev inequalities for some models of random walk, including the ran...
متن کاملCutoff for a Stratified Random Walk on the Hypercube
We consider the random walk on the hypercube which moves by picking an ordered pair (i, j) of distinct coordinates uniformly at random and adding the bit at location i to the bit at location j, modulo 2. We show that this Markov chain has cutoff at time 2n logn with window of size n, solving a question posed by Chung and Graham (1997). 1998 ACM Subject Classification G.3 Probability
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015